Time Asymptotic Behaviour for a One-Velocity Transport Operator with Maxwell Boundary Condition

This paper is concerned with the spectral analysis of a one-velocity transport operator with Maxwell boundary condition in L ₁-space. After a detailed spectral analysis it is shown that the associated Cauchy problem is governed by a C ₀-semigroup. Next, we discuss the irreducibility of the transport semigroup. In particular, we show that the transport semigroup is irreducible. Finally, a spectral decomposition of the solutions into an asymptotic term and a transient one which will be estimated for smooth initial data is given.     

On error bounds for lower semicontinuous functions

We give some sufficient conditions for proper lower semicontinuous functions on metric spaces to have error bounds (with exponents). For a proper convex function f on a normed space X the existence of a local error bound implies that of a global error bound. If in addition X is a Banach space, then error bounds can be characterized by the subdifferential of f. In a reflexive Banach space X, we further obtain several sufficient and necessary conditions for the existence of error bounds in terms of the lower Dini derivative of f. Received: April 27, 2001 / Accepted: November 6, 2001?Published online April 12, 2002     

Thermoelectric properties of tin clathrates under hydrostatic pressure

We report the temperature dependence of electrical resistance (R) and thermopower (S) of clathrate Cs₈Sn₄₄ under high pressure up to 1.2 GPa. We observe a reversible gap widening, prominent relaxation effect of R, irreversible increase of |S| under high pressure. We also find that the power factor S²σ (σ: electrical conductivity) reaches a maximum at pressure of 0.3 GPa. Comparison of the experimental results with band structure calculations suggests that the intrinsic vacancy in the clathrate structure of Cs₈Sn₄₄ plays an important role in transport properties under high pressure. Measurements on Cs₈Zn₄Sn₄₂, a clathrate which has defects other than vacancies, are compared with Cs₈Sn₄₄. The results indicate that replacing Sn by Zn has similar effect as the intrinsic vacancy on S.     

Learning Markov chains in fractal compression of image data

In a recent paper [17] we proposed a stochastic algorithm which generates optimal probabilities for the decompression of an image represented by the fixed point of an IFS system (SAOP). We show here that such an algorithm is in fact a non trivial example of Generalized Random System with Complete Connections. We also exhibit a generalization which could represent the solution to the inverse problem for an image with grey levels, if a fixed set of contraction maps is available. Received: 1 July 2002     

泛连通图定理和Ore2条件

记Ore2=min{d(y) d(x)|x,y∈V(G),d(x,y)=2}，本得到：若n阶图G的Ore2≥n 1，则G是[5;n]泛连通图。此是比Faudree等人的定理进一步的结果。     

Use of a long-spacer-side-chain liquid crystalline polysiloxane containing a crown ether as a stationary phase for capillary gas chromatography

A new kind of side chain liquid crystalline polysiloxane containing a crown ether with a longer spacer (PSC-11) has been prepared and coated on a fused silica capillary column. The main chroma-tographic characteristics including efficiency, polarity, and selectivity have been examined. The phase exhibits the retention properties of both liquid crystal and crown ether stationary phases and possesses higher efficiency and better selectivity than PSC-3, which has a shorter spacer between the main polysiloxane chain and liquid crystalline side chain.     

受激喇曼散射在掺铒光纤放大器中的影响

本文在分析了均匀掺杂分布式光纤放大器（d－EDFA）的基础上，提出了沿传输方向掺杂浓度单调下降（单变），和降升结合（两变）的两种渐变型分布式光纤放大器，并用传输方程研究了透明传输和最佳掺杂浓度下，受激喇曼散射对均匀、单变和两变型三种d－EDFA的各种特性的影响．     

A simulated annealing algorithm for resource constrained project scheduling problems

This paper presents a simulated annealing algorithm for resource constrained project scheduling problems with the objective of minimising makespan. In the search algorithm, a solution is represented with a priority list, a vector of numbers each of which denotes the priority of each activity. In the algorithm, a priority scheduling method is used for making a complete schedule from a given priority list (and hence a project schedule is defined by a priority list). The search algorithm is applied to find a priority list which corresponds to a good project schedule. Unlike most of priority scheduling methods, in the suggested algorithm some activities are delayed on purpose so as to extend search space. Solutions can be further improved by delaying certain activities, since non-delay schedules are not dominant in the problem (the set of non-delay schedules does not always include an optimal solution). The suggested algorithm is flexible in that it can be easily applied to problems with an objective function of a general form and/or complex constraints. The performance of the simulated annealing algorithm is compared with existing heuristics on problems prepared by Patterson and randomly generated test problems. Computational results showed that the suggested algorithm outperformed existing ones.